Anatomy of a Parallel Out-of-Core Dense Linear Solver
نویسندگان
چکیده
{ In this paper, we describe the design and implementation of the Platform Independent Parallel Solver (PIPSolver) package for the out-of-core (OOC) solution of complex dense linear systems. Our approach is unique in that it allows essentially all of RAM to be lled with the current portion of the matrix (slab) to be updated and fac-tored, thereby greatly improving the computation to I/O ratio over previous approaches. Experiences and performance are reported for the Cray T3D system.
منابع مشابه
A Dense Out-of-Core Solver (DOCS) for Complex-Valued Linear Systems
Dense systems of linear equations are quite common in many science and engineering applications. Such linear systems place extreme storage and computational demands on computer resources and, in many cases, may severely limit the subsequent analysis. A dense out-of-core solver (DOCS) that operates on a partitioned coefficient matrix can reduce the in-core storage requirements of the linear syst...
متن کاملPOOCLAPACK: Parallel Out-of-Core Linear Algebra Package
In this paper parallel implementation of out-of-core Cholesky factorization is used to introduce the Parallel Outof-Core Linear Algebra Package (POOCLAPACK), a flexible infrastructure for parallel implementation of out-of-core linear algebra operations. POOCLAPACK builds on the Parallel Linear Algebra Package (PLAPACK) for in-core parallel dense linear algebra computation. Despite the extreme s...
متن کاملSymmetric Indefinite Linear Solver using OpenMP Task on Multicore Architectures
Recently, the Open Multi-Processing (OpenMP) standard has incorporated task-based programming, where a function call with input and output data is treated as a task. At run time, OpenMP’s superscalar scheduler tracks the data dependencies among the tasks and executes the tasks as their dependencies are resolved. On a shared-memory architecture with multiple cores, the independent tasks are exec...
متن کاملAn efficient distributed randomized algorithm for solving large dense symmetric indefinite linear systems
Randomized algorithms are gaining ground in high-performance computing applications as they have the potential to outperform deterministic methods, while still providing accurate results. We propose a randomized solver for distributed multicore architectures to efficiently solve large dense symmetric indefinite linear systems that are encountered, for instance, in parameter estimation problems ...
متن کاملAn efficient multi-core implementation of a novel HSS-structured multifrontal solver using randomized sampling
We present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination, and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with i...
متن کامل